منابع مشابه
Ĝ Ĝ Λ 11 Λ 12 Λ 21 Λ 21 Λ 22 Λ 22 Λ Λ̃ 0 0 Λ̂
In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given Markov model. We illustrate the method by implementing it for a range of models, including a local Lévy process and a local volatility jump-diffusion. We also pro...
متن کاملRare Λ b → Λ l + l − Decays with Polarized Λ
We investigate the rare baryonic exclusive decays of Λb → Λll (l = e, μ, τ) with polarized Λ. Under the approximation of the heavy quark effective theory (HQET), in the standard model we derive the differential decay rates and various polarization asymmetries by including lepton mass effects. We find that with the long-distance effects the decay branching ratios are 5.3× 10 for Λb → Λll (l = e,...
متن کاملDistributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کاملDouble Λ Hypernuclei and the Λ-λ Interaction. *
We approximate the double Λ hypernuclei by systems composed by two interacting Λ’s moving in the mean field potential created by the nuclear cores. The Λ-core potentials are adjusted to reproduce the binding energies of the corresponding single Λ hypernuclei [1]. A σ-ω meson exchange potential [2] is used for the Λ-Λ interaction. We apply both the Hartree-Fock (HF) and variational approximation...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal H
سال: 2018
ISSN: 2102-6459,2102-6467
DOI: 10.1140/epjh/e2018-90007-y